Differentiable quantum architecture search

نویسندگان

چکیده

Abstract Quantum architecture search (QAS) is the process of automating engineering quantum circuits. It has been desired to construct a powerful and general QAS platform which can significantly accelerate current efforts identify advantages error-prone depth-limited circuits in NISQ era. Hereby, we propose framework differentiable (DQAS), enables automated designs an end-to-end fashion. We present several examples circuit design problems demonstrate power DQAS. For instance, unitary operations are decomposed into gates, noisy re-designed improve accuracy, layouts for approximation optimization algorithm automatically discovered upgraded combinatorial problems. These results not only manifest vast potential DQAS being essential tool application developments, but also interesting research topic from theoretical perspective as it draws inspirations newly emerging interdisciplinary paradigms programming, probabilistic programming.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Differentiable Neural Network Architecture Search

The successes of deep learning in recent years has been fueled by the development of innovative new neural network architectures. However, the design of a neural network architecture remains a difficult problem, requiring significant human expertise as well as computational resources. In this paper, we propose a method for transforming a discrete neural network architecture space into a continu...

متن کامل

Quantum estimation for non-differentiable models

State estimation is a classical problem in quantum information. In optimization of estimation scheme, to find a lower bound to the error of the estimator is a very important step. So far, all the proposed tractable lower bounds use derivative of density matrix. However, sometimes, we are interested in quantities with singularity, e.g. concurrence etc. In the paper, lower bounds to a Mean Square...

متن کامل

Constants of Motion for Non-Differentiable Quantum Variational Problems

We extend the DuBois-Reymond necessary optimality condition and Noether’s symmetry theorem to the scale relativity theory setting. Both Lagrangian and Hamiltonian versions of Noether’s theorem are proved, covering problems of the calculus of variations with functionals defined on sets of non-differentiable functions, as well as more general non-differentiable problems of optimal control. As an ...

متن کامل

Progressive Neural Architecture Search

We propose a method for learning CNN structures that is more efficient than previous approaches: instead of using reinforcement learning (RL) or genetic algorithms (GA), we use a sequential model-based optimization (SMBO) strategy, in which we search for architectures in order of increasing complexity, while simultaneously learning a surrogate function to guide the search, similar to A* search....

متن کامل

A Global Search Architecture

Recent advances in communication and storage technology make available vast quantities of on line information But this information is of limited use unless it can be searched e ectively Huge scale and heterogeneity of data raise a unique combination of architectural issues that must be addressed to support e ective search These issues occasion the use of multi user distributed search databases ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Quantum science and technology

سال: 2022

ISSN: ['2364-9054', '2364-9062']

DOI: https://doi.org/10.1088/2058-9565/ac87cd